Kernel Methods for Pattern Analysis
نویسنده
چکیده
rich family of ‘pattern analysis’ algorithms, whose best known element is the Support Vector Machine very general task: given a set of data (any form, not necessarily vectors), find patterns (= any relations). (Examples of relations: classifications, regressions, principal directions, correlations, clusters, rankings, etc....) (Examples of data: gene expression; protein sequences; heterogeneous descriptions of genes; text and hypertext documents; etc. etc.)
منابع مشابه
THE COMPARISON OF TWO METHOD NONPARAMETRIC APPROACH ON SMALL AREA ESTIMATION (CASE: APPROACH WITH KERNEL METHODS AND LOCAL POLYNOMIAL REGRESSION)
Small Area estimation is a technique used to estimate parameters of subpopulations with small sample sizes. Small area estimation is needed in obtaining information on a small area, such as sub-district or village. Generally, in some cases, small area estimation uses parametric modeling. But in fact, a lot of models have no linear relationship between the small area average and the covariat...
متن کاملLearning Kernel Subspace Classifier for Robust Face Recognition
Subspace classifiers are very important in pattern recognition in which pattern classes are described in terms of linear subspaces spanned by their respective basis vectors. To overcome the limitations of linear methods, kernel based subspace models have been proposed in the past by applying the Kernel Principal Component Analysis (KPCA). However, the projection variance in the kernel space as ...
متن کاملOptimizing Kernel Function with Applications to Kernel Principal Analysis and Locality Preserving Projection for Feature Extraction
Kernel learning is a popular research topic in pattern recognition and machine learning. Kernel selection is a crucial problem endured by kernel learning method in the practical applications. Many methods of finding the optimal parameters have been presented, but this kind of methods have no ability of changing the kernel structure, accordingly without changing the data distribution in kernel m...
متن کاملAn interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
In this paper, an interior-point algorithm for $P_{ast}(kappa)$-Linear Complementarity Problem (LCP) based on a new parametric trigonometric kernel function is proposed. By applying strictly feasible starting point condition and using some simple analysis tools, we prove that our algorithm has $O((1+2kappa)sqrt{n} log nlogfrac{n}{epsilon})$ iteration bound for large-update methods, which coinc...
متن کاملKernel Methods for Exploratory Pattern Analysis: A Demonstration on Text Data
Kernel Methods are a class of algorithms for pattern analysis with a number of convenient features. They can deal in a uniform way with a multitude of data types and can be used to detect many types of relations in data. Importantly for applications, they have a modular structure, in that any kernel function can be used with any kernel-based algorithm. This means that customized solutions can b...
متن کاملFlatten a Curved Space by Kernel Insight into Kernel Methods: a Transductive Paradigm
D ue to the recent explosion of data from all fields of science, there is an increasing need for pattern analysis tools, which are capable of analyzing data patterns in a nonEuclidean (curved) space. Because linear approaches are not directly applicable to handle data in a curved space, nonlinear approaches are to be used. Early-day nonlinear approaches were usually based on gradient descent or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003